Optimized Image Resizing Using Seam Carving and Scaling

International audienceWe present a novel method for content-aware image resizing based on optimization of a well-defined image distance function, which preserves both the important regions and the global visual effect (the background or other decorative objects) of an image. The method operates by joint use of seam carving and image scaling. The principle behind our method is the use of a bidirectional similarity function of image Euclidean distance (IMED), while cooperating with a dominant color descriptor (DCD) similarity and seam energy variation. The function is suitable for the quantitative evaluation of the resizing result and the determination of the best seam carving number. ifferent from the previous simplex-modeapproaches, our method takes the advantages of both discrete and continuous methods. The technique is useful in image resizing for both reduction/retargeting and enlarging. We also show that this approach can be extended to indirect image resizing

Investigation of hospital discharge cases and SARS-CoV-2 introduction into Lothian care homes

Summary Background The first epidemic wave of severe acute respiratory syndrome coronavirus-2 (SARS-CoV-2) in Scotland resulted in high case numbers and mortality in care homes. In Lothian, over one-third of care homes reported an outbreak, while there was limited testing of hospital patients discharged to care homes. Aim To investigate patients discharged from hospitals as a source of SARS-CoV-2 introduction into care homes during the first epidemic wave. Methods A clinical review was performed for all patients discharges from hospitals to care homes from 1st March 2020 to 31st May 2020. Episodes were ruled out based on coronavirus disease 2019 (COVID-19) test history, clinical assessment at discharge, whole-genome sequencing (WGS) data and an infectious period of 14 days. Clinical samples were processed for WGS, and consensus genomes generated were used for analysis using Cluster Investigation and Virus Epidemiological Tool software. Patient timelines were obtained using electronic hospital records. Findings In total, 787 patients discharged from hospitals to care homes were identified. Of these, 776 (99%) were ruled out for subsequent introduction of SARS-CoV-2 into care homes. However, for 10 episodes, the results were inconclusive as there was low genomic diversity in consensus genomes or no sequencing data were available. Only one discharge episode had a genomic, time and location link to positive cases during hospital admission, leading to 10 positive cases in their care home. Conclusion The majority of patients discharged from hospitals were ruled out for introduction of SARS-CoV-2 into care homes, highlighting the importance of screening all new admissions when faced with a novel emerging virus and no available vaccine

Psicopatología en el paciente atópico, funcionamiento familiar y calidad de vida del cuidador

Abstract. Generating meaningful digests of videos by extracting interesting frames remains a difficult task. In this paper, we define interesting events as unusual events which occur rarely in the entire video and we propose a novel interesting event summarization framework based on the technique of density ratio estimation recently introduced in machine learning. Our proposed framework is unsupervised and it can be applied to general video sources, including videos from moving cameras. We evaluated the proposed approach on a publicly available dataset in the context of anomalous crowd behavior and with a challenging personal video dataset. We demonstrated competitive performance both in accuracy relative to human annotation and computation time

Byexample synthesis of architectural textures

This additional material first shows more synthesis results in Section 5 and give further details and illustrates the way our synthesised textures are filtered in the GPU fragment shader in Section 1 While the main paper gives a complete description of our system for synthesizing architectural textures, there is also a number of small algorithmic improvements that build on the special nature of our problem and provide a faster implementation. We describe them here, since they are not specifically related to the core of our synthesis system. They deal with Dijkstra’s algorithm (Section 2, page 1), the integration of a histogram computation into Dijkstra’s algorithm’s inner loop (Section 3, page 3) and the fast construction of the graph G (Section 4, page 4). Many notations that are used here are defined in the main paper and not redefined here. Please refer to the paper for their definition.